________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 21:18:49
Input Data from:  dataset154.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,146
Average f[i]   :4975
Average g[i,j] :2075
Total demand   :10710
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 19
> Selected Move:	0	1	-1	2	4500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 18
> Selected Move:	650	1	-1	3	9000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 650


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 81
> Selected Move:	1990	1	-1	4	15500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1990


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 55
> Selected Move:	3550	1	-1	7	22000


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3550


> New S[]: 
	
	 0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 41
> Selected Move:	4100	1	-1	13	26000


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 60
> Selected Move:	4600	3	7	18	24500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0    >new incumb.: 4600


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 51
> Selected Move:	5090	3	2	10	24500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0    >new incumb.: 5090


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 65
> Selected Move:	5280	3	4	12	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0  0  1  0    >new incumb.: 5280


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 62
> Selected Move:	5300	3	3	16	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1  0  1  0    >new incumb.: 5300


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 71
> Selected Move:	5200	3	16	6	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 43
> Selected Move:	5304	3	0	14	26200


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  0  1  1  2  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 19
> Selected Move:	5880	4	14	12	24000


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  0  2  1  1  0  0  0  1  0    >new incumb.: 5880


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 62
> Selected Move:	5760	3	14	16	24500


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  0  2  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 68
> Selected Move:	5470	3	6	3	24500


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  1  0  2  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 89
> Selected Move:	5450	3	16	14	24000


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  1  0  2  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 87
> Selected Move:	5343	3	10	5	25500


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  0  2  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 45
> Selected Move:	5705	3	3	6	25500


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  0  0  0  2  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 57
> Selected Move:	5396	4	12	5	26200


> New Y[]: 
	
	 0  3  0  0  0  2  1  0  0  0  0  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 45
> Selected Move:	5528	3	5	10	25800


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  2  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 19 #######################


> Neighbours evaluated; 38
> Selected Move:	5435	4	10	18	26000


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  0  1  1  1  0  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 20 #######################


> Neighbours evaluated; 41
> Selected Move:	5525	3	18	7	25700


> New Y[]: 
	
	 0  3  0  0  0  0  1  2  0  0  1  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 21 #######################


> Neighbours evaluated; 24
> Selected Move:	5613	4	7	12	25500


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  0  1  0  2  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 22 #######################


> Neighbours evaluated; 46
> Selected Move:	5390	3	14	16	26000


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  0  1  0  2  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 23 #######################


> Neighbours evaluated; 31
> Selected Move:	5292	4	12	7	26200


> New Y[]: 
	
	 0  3  0  0  0  0  1  2  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 24 #######################


> Neighbours evaluated; 47
> Selected Move:	5055	3	7	18	26500


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  0  1  1  0  0  1  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 25 #######################


> Neighbours evaluated; 44
> Selected Move:	5142	4	18	10	26300


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  2  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 26 #######################


> Neighbours evaluated; 51
> Selected Move:	5040	4	10	16	26500


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  0  1  1  0  0  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 27 #######################


> Neighbours evaluated; 53
> Selected Move:	4936	4	16	6	26700


> New Y[]: 
	
	 0  3  0  0  0  0  2  0  0  0  1  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 28 #######################


> Neighbours evaluated; 41
> Selected Move:	5292	3	16	14	26200


> New Y[]: 
	
	 0  3  0  0  0  0  2  0  0  0  1  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 29 #######################


> Neighbours evaluated; 38
> Selected Move:	5160	3	6	0	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 30 #######################


> Neighbours evaluated; 57
> Selected Move:	5360	3	1	6	25900


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  0  0  1  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 31 #######################


> Neighbours evaluated; 24
> Selected Move:	5810	4	6	12	24800


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  0  3  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 32 #######################


> Neighbours evaluated; 45
> Selected Move:	5607	3	14	16	25300


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  0  3  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 33 #######################


> Neighbours evaluated; 50
> Selected Move:	5316	3	6	3	25300


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  3  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,52

## ITERATION 34 #######################


> Neighbours evaluated; 63
> Selected Move:	5450	3	16	14	24800


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  3  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,525

## ITERATION 35 #######################


> Neighbours evaluated; 65
> Selected Move:	5188	4	12	10	25500


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  3  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,53

## ITERATION 36 #######################


> Neighbours evaluated; 39
> Selected Move:	5545	3	3	6	25500


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  3  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 37 #######################


> Neighbours evaluated; 38
> Selected Move:	5436	4	10	18	25700


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  0  1  1  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 38 #######################


> Neighbours evaluated; 45
> Selected Move:	5460	3	18	7	25500


> New Y[]: 
	
	 2  0  0  0  0  0  1  3  0  0  1  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 39 #######################


> Neighbours evaluated; 41
> Selected Move:	5305	3	14	16	26000


> New Y[]: 
	
	 2  0  0  0  0  0  1  3  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 40 #######################


> Neighbours evaluated; 39
> Selected Move:	5100	3	7	18	26200


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  0  1  1  0  0  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,555

## ITERATION 41 #######################


> Neighbours evaluated; 37
> Selected Move:	5205	4	18	10	26000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  3  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,56

## ITERATION 42 #######################


> Neighbours evaluated; 46
> Selected Move:	5032	4	10	16	26300


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  0  1  1  0  0  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 43 #######################


> Neighbours evaluated; 40
> Selected Move:	5188	3	16	14	26100


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  0  1  1  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 44 #######################


> Neighbours evaluated; 54
> Selected Move:	4841	4	14	13	26700


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  0  1  3  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,575

## ITERATION 45 #######################


> Neighbours evaluated; 51
> Selected Move:	4850	3	13	1	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  1  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0 
 > pw :0,58

## ITERATION 46 #######################


> Neighbours evaluated; 55
> Selected Move:	4990	3	14	16	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0 
 > pw :0,585

## ITERATION 47 #######################


> Neighbours evaluated; 45
> Selected Move:	4990	3	10	13	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0 
 > pw :0,59

## ITERATION 48 #######################


> Neighbours evaluated; 62
> Selected Move:	4990	3	12	4	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,595

## ITERATION 49 #######################


> Neighbours evaluated; 64
> Selected Move:	5200	3	16	10	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,6

## ITERATION 50 #######################


> Neighbours evaluated; 65
> Selected Move:	5200	3	4	15	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0 
 > pw :0,595

## ITERATION 51 #######################


> Neighbours evaluated; 58
> Selected Move:	5170	3	15	11	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0 
 > pw :0,59

## ITERATION 52 #######################


> Neighbours evaluated; 49
> Selected Move:	5170	3	6	3	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,585

## ITERATION 53 #######################


> Neighbours evaluated; 59
> Selected Move:	5170	3	3	16	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 
 > pw :0,58

## ITERATION 54 #######################


> Neighbours evaluated; 53
> Selected Move:	5160	3	16	14	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0 
 > pw :0,575

## ITERATION 55 #######################


> Neighbours evaluated; 61
> Selected Move:	5030	3	11	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 56 #######################


> Neighbours evaluated; 68
> Selected Move:	5070	3	14	16	25000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 57 #######################


> Neighbours evaluated; 62
> Selected Move:	5070	3	4	15	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,56

## ITERATION 58 #######################


> Neighbours evaluated; 68
> Selected Move:	5090	3	16	3	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,555

## ITERATION 59 #######################


> Neighbours evaluated; 68
> Selected Move:	5050	3	15	8	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,55

## ITERATION 60 #######################


> Neighbours evaluated; 71
> Selected Move:	5120	3	3	6	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 61 #######################


> Neighbours evaluated; 74
> Selected Move:	5220	3	18	12	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 62 #######################


> Neighbours evaluated; 60
> Selected Move:	5050	3	6	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 63 #######################


> Neighbours evaluated; 69
> Selected Move:	5012	3	10	18	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,53

## ITERATION 64 #######################


> Neighbours evaluated; 62
> Selected Move:	5015	3	8	5	25500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  0  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,525

## ITERATION 65 #######################


> Neighbours evaluated; 60
> Selected Move:	4960	3	5	16	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0 
 > pw :0,52

## ITERATION 66 #######################


> Neighbours evaluated; 64
> Selected Move:	4960	3	12	4	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,515

## ITERATION 67 #######################


> Neighbours evaluated; 73
> Selected Move:	4960	3	4	5	24500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,51

## ITERATION 68 #######################


> Neighbours evaluated; 68
> Selected Move:	5060	3	0	12	26000


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  0  2  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,505

## ITERATION 69 #######################


> Neighbours evaluated; 56
> Selected Move:	5305	3	3	6	26000


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  0  0  0  2  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 70 #######################


> Neighbours evaluated; 63
> Selected Move:	4990	3	12	0	24500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,495

## ITERATION 71 #######################


> Neighbours evaluated; 79
> Selected Move:	4990	3	5	8	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 72 #######################


> Neighbours evaluated; 76
> Selected Move:	4990	3	8	10	23000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 73 #######################


> Neighbours evaluated; 63
> Selected Move:	5230	3	0	19	24900


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  0  0  1  0  0  1  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,48

## ITERATION 74 #######################


> Neighbours evaluated; 80
> Selected Move:	5330	3	16	14	24400


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 75 #######################


> Neighbours evaluated; 89
> Selected Move:	5220	3	19	11	24000


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  2  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 76 #######################


> Neighbours evaluated; 87
> Selected Move:	5200	3	14	16	24500


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  2  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 77 #######################


> Neighbours evaluated; 85
> Selected Move:	4960	3	6	3	24500


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  1  2  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 78 #######################


> Neighbours evaluated; 92
> Selected Move:	4960	3	11	0	23000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 79 #######################


> Neighbours evaluated; 76
> Selected Move:	5070	3	1	4	24600


> New Y[]: 
	
	 2  0  0  1  3  0  0  0  0  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 80 #######################


> Neighbours evaluated; 85
> Selected Move:	5070	3	3	6	24600


> New Y[]: 
	
	 2  0  0  0  3  0  1  0  0  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 81 #######################


> Neighbours evaluated; 85
> Selected Move:	5200	3	4	11	24900


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  3  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 82 #######################


> Neighbours evaluated; 63
> Selected Move:	5220	3	16	14	24400


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  3  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 83 #######################


> Neighbours evaluated; 69
> Selected Move:	5330	3	11	19	24800


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 84 #######################


> Neighbours evaluated; 77
> Selected Move:	5115	4	19	10	25500


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  3  0  0  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 85 #######################


> Neighbours evaluated; 69
> Selected Move:	5035	3	10	4	25600


> New Y[]: 
	
	 2  0  0  0  3  0  1  0  0  0  0  0  0  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 86 #######################


> Neighbours evaluated; 94
> Selected Move:	5030	3	19	10	24100


> New Y[]: 
	
	 2  0  0  0  3  0  1  0  0  0  1  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 87 #######################


> Neighbours evaluated; 93
> Selected Move:	5031	3	10	12	25600


> New Y[]: 
	
	 2  0  0  0  3  0  1  0  0  0  0  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 88 #######################


> Neighbours evaluated; 70
> Selected Move:	5277	3	4	5	26300


> New Y[]: 
	
	 2  0  0  0  0  3  1  0  0  0  0  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 89 #######################


> Neighbours evaluated; 52
> Selected Move:	5284	4	5	12	26300


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  3  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 90 #######################


> Neighbours evaluated; 71
> Selected Move:	5072	3	14	16	26800


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  3  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 91 #######################


> Neighbours evaluated; 54
> Selected Move:	5063	4	12	5	26800


> New Y[]: 
	
	 2  0  0  0  0  3  1  0  0  0  0  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 92 #######################


> Neighbours evaluated; 69
> Selected Move:	4858	3	5	4	26100


> New Y[]: 
	
	 2  0  0  0  3  0  1  0  0  0  0  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 93 #######################


> Neighbours evaluated; 75
> Selected Move:	4863	3	12	19	26100


> New Y[]: 
	
	 2  0  0  0  3  0  1  0  0  0  0  0  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 94 #######################


> Neighbours evaluated; 87
> Selected Move:	4800	3	4	10	26000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  3  0  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 95 #######################


> Neighbours evaluated; 56
> Selected Move:	5100	4	10	19	25300


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 96 #######################


> Neighbours evaluated; 80
> Selected Move:	4890	3	19	8	24900


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  3  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 97 #######################


> Neighbours evaluated; 91
> Selected Move:	5010	3	16	14	24400


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  3  0  1  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 98 #######################


> Neighbours evaluated; 89
> Selected Move:	5030	3	8	15	25000


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  0  0  1  0  0  1  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 99 #######################


> Neighbours evaluated; 80
> Selected Move:	4930	3	6	3	25000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  0  1  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 100 #######################


> Neighbours evaluated; 88
> Selected Move:	5000	3	15	8	24400


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  3  0  1  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 101 #######################


> Neighbours evaluated; 91
> Selected Move:	4950	3	8	4	24100


> New Y[]: 
	
	 2  0  0  1  3  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 102 #######################


> Neighbours evaluated; 94
> Selected Move:	4904	3	10	12	25600


> New Y[]: 
	
	 2  0  0  1  3  0  0  0  0  0  0  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 103 #######################


> Neighbours evaluated; 76
> Selected Move:	4978	3	4	5	26300


> New Y[]: 
	
	 2  0  0  1  0  3  0  0  0  0  0  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 104 #######################


> Neighbours evaluated; 66
> Selected Move:	4985	4	5	12	26300


> New Y[]: 
	
	 2  0  0  1  0  1  0  0  0  0  0  0  3  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 105 #######################


> Neighbours evaluated; 78
> Selected Move:	4800	3	12	1	24000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 106 #######################


> Neighbours evaluated; 89
> Selected Move:	4940	3	3	12	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 107 #######################


> Neighbours evaluated; 68
> Selected Move:	4983	3	14	6	25500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 108 #######################


> Neighbours evaluated; 57
> Selected Move:	4980	3	5	8	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 109 #######################


> Neighbours evaluated; 61
> Selected Move:	4938	3	6	14	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 110 #######################


> Neighbours evaluated; 75
> Selected Move:	5010	3	12	10	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 111 #######################


> Neighbours evaluated; 89
> Selected Move:	5030	3	8	15	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 112 #######################


> Neighbours evaluated; 80
> Selected Move:	4850	3	10	6	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0 
 > pw :0,465

## ITERATION 113 #######################


> Neighbours evaluated; 72
> Selected Move:	4990	3	14	16	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0 
 > pw :0,47

## ITERATION 114 #######################


> Neighbours evaluated; 59
> Selected Move:	4990	3	15	11	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  1  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 115 #######################


> Neighbours evaluated; 54
> Selected Move:	4990	3	18	10	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 116 #######################


> Neighbours evaluated; 61
> Selected Move:	4990	3	11	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 117 #######################


> Neighbours evaluated; 74
> Selected Move:	4990	3	4	7	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 118 #######################


> Neighbours evaluated; 52
> Selected Move:	5040	3	1	12	26800


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  1  0  3  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 119 #######################


> Neighbours evaluated; 43
> Selected Move:	5152	3	16	14	26300


> New Y[]: 
	
	 2  0  0  0  0  0  1  1  0  0  1  0  3  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 120 #######################


> Neighbours evaluated; 47
> Selected Move:	4878	3	6	3	26300


> New Y[]: 
	
	 2  0  0  1  0  0  0  1  0  0  1  0  3  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 121 #######################


> Neighbours evaluated; 34
> Selected Move:	5233	4	12	7	25500


> New Y[]: 
	
	 2  0  0  1  0  0  0  3  0  0  1  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 122 #######################


> Neighbours evaluated; 60
> Selected Move:	5149	3	7	18	25700


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  1  1  1  0  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 123 #######################


> Neighbours evaluated; 65
> Selected Move:	5059	4	18	3	25900


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  1  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 124 #######################


> Neighbours evaluated; 67
> Selected Move:	4966	4	3	14	26100


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  1  1  3  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 125 #######################


> Neighbours evaluated; 70
> Selected Move:	4892	3	14	16	26300


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  1  1  0  0  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 126 #######################


> Neighbours evaluated; 55
> Selected Move:	5020	4	16	10	26000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  3  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 127 #######################


> Neighbours evaluated; 64
> Selected Move:	4924	4	10	18	26200


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  1  1  0  0  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 128 #######################


> Neighbours evaluated; 58
> Selected Move:	5010	3	18	7	26000


> New Y[]: 
	
	 2  0  0  1  0  0  0  3  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 129 #######################


> Neighbours evaluated; 55
> Selected Move:	4960	3	7	1	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 130 #######################


> Neighbours evaluated; 68
> Selected Move:	4990	3	3	6	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 131 #######################


> Neighbours evaluated; 66
> Selected Move:	4990	3	12	15	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 132 #######################


> Neighbours evaluated; 62
> Selected Move:	4960	3	6	3	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0 
 > pw :0,485

## ITERATION 133 #######################


> Neighbours evaluated; 75
> Selected Move:	4960	3	10	18	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0 
 > pw :0,49

## ITERATION 134 #######################


> Neighbours evaluated; 65
> Selected Move:	4960	3	15	8	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 135 #######################


> Neighbours evaluated; 73
> Selected Move:	4960	3	8	11	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0 
 > pw :0,48

## ITERATION 136 #######################


> Neighbours evaluated; 61
> Selected Move:	4960	3	18	10	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 137 #######################


> Neighbours evaluated; 73
> Selected Move:	4960	3	11	4	24500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 138 #######################


> Neighbours evaluated; 85
> Selected Move:	4960	3	4	7	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 139 #######################


> Neighbours evaluated; 53
> Selected Move:	5005	3	0	12	26000


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  0  1  0  2  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 140 #######################


> Neighbours evaluated; 54
> Selected Move:	5220	3	16	14	25500


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  0  0  1  0  2  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 141 #######################


> Neighbours evaluated; 53
> Selected Move:	5132	4	12	7	25700


> New Y[]: 
	
	 0  3  0  1  0  0  0  2  0  0  1  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 142 #######################


> Neighbours evaluated; 68
> Selected Move:	5000	3	7	18	26000


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  1  0  1  1  1  0  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 143 #######################


> Neighbours evaluated; 62
> Selected Move:	5094	4	18	10	25800


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  2  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 144 #######################


> Neighbours evaluated; 72
> Selected Move:	5030	3	10	5	26200


> New Y[]: 
	
	 0  3  0  1  0  2  0  0  0  0  0  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 145 #######################


> Neighbours evaluated; 85
> Selected Move:	4800	3	5	0	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 146 #######################


> Neighbours evaluated; 73
> Selected Move:	4850	3	3	6	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 147 #######################


> Neighbours evaluated; 65
> Selected Move:	4850	3	12	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,47

## ITERATION 148 #######################


> Neighbours evaluated; 88
> Selected Move:	4850	3	4	5	24000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 149 #######################


> Neighbours evaluated; 71
> Selected Move:	5032	3	0	11	25500


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  0  0  2  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 150 #######################


> Neighbours evaluated; 67
> Selected Move:	5020	3	5	8	25500


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  1  0  0  2  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 151 #######################


> Neighbours evaluated; 83
> Selected Move:	5018	3	11	12	25500


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  1  0  0  0  2  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 152 #######################


> Neighbours evaluated; 87
> Selected Move:	5010	3	18	10	25000


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  1  0  1  0  2  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 153 #######################


> Neighbours evaluated; 86
> Selected Move:	5000	3	6	3	25000


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  1  0  1  0  2  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 154 #######################


> Neighbours evaluated; 89
> Selected Move:	4805	3	14	18	25500


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  1  0  1  0  2  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 155 #######################


> Neighbours evaluated; 84
> Selected Move:	4878	3	3	6	25500


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  1  0  1  0  2  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 156 #######################


> Neighbours evaluated; 79
> Selected Move:	4880	3	13	14	26000


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  1  0  1  0  2  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 157 #######################


> Neighbours evaluated; 71
> Selected Move:	5010	3	8	2	24500


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  1  0  2  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 158 #######################


> Neighbours evaluated; 71
> Selected Move:	5050	3	14	16	25000


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  1  0  2  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,505

## ITERATION 159 #######################


> Neighbours evaluated; 67
> Selected Move:	4720	3	16	13	24000


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  0  0  1  0  2  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,51

## ITERATION 160 #######################


> Neighbours evaluated; 78
> Selected Move:	4840	3	2	3	24000


> New Y[]: 
	
	 0  3  0  1  0  0  1  0  0  0  1  0  2  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,505

## ITERATION 161 #######################


> Neighbours evaluated; 64
> Selected Move:	4798	3	10	5	25500


> New Y[]: 
	
	 0  3  0  1  0  1  1  0  0  0  0  0  2  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 162 #######################


> Neighbours evaluated; 65
> Selected Move:	4680	2	3	-1	21000


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  0  0  0  0  2  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 163 #######################


> Neighbours evaluated; 87
> Selected Move:	4680	4	12	5	21700


> New Y[]: 
	
	 0  3  0  0  0  2  1  0  0  0  0  0  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 164 #######################


> Neighbours evaluated; 84
> Selected Move:	4977	1	-1	16	26700


> New Y[]: 
	
	 0  3  0  0  0  2  1  0  0  0  0  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 165 #######################


> Neighbours evaluated; 67
> Selected Move:	4746	3	6	3	26700


> New Y[]: 
	
	 0  3  0  1  0  2  0  0  0  0  0  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,48

## ITERATION 166 #######################


> Neighbours evaluated; 72
> Selected Move:	4846	3	5	10	26300


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  2  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 167 #######################


> Neighbours evaluated; 71
> Selected Move:	4758	4	10	16	26500


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  1  0  1  1  0  0  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0 
 > pw :0,48

## ITERATION 168 #######################


> Neighbours evaluated; 62
> Selected Move:	4874	3	16	14	26200


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  1  0  1  1  2  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 169 #######################


> Neighbours evaluated; 72
> Selected Move:	4725	3	14	17	26000


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 170 #######################


> Neighbours evaluated; 75
> Selected Move:	4750	3	3	6	26000


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  0  1  1  0  0  0  2  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 171 #######################


> Neighbours evaluated; 66
> Selected Move:	4922	3	18	14	25500


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  0  1  1  1  0  0  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 172 #######################


> Neighbours evaluated; 70
> Selected Move:	4920	4	17	12	25500


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  0  2  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 173 #######################


> Neighbours evaluated; 87
> Selected Move:	4750	3	17	19	25000


> New Y[]: 
	
	 0  3  0  0  0  0  1  0  0  0  1  0  2  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 174 #######################


> Neighbours evaluated; 84
> Selected Move:	4973	3	12	7	25700


> New Y[]: 
	
	 0  3  0  0  0  0  1  2  0  0  1  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 175 #######################


> Neighbours evaluated; 59
> Selected Move:	4866	4	7	19	25900


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  0  1  0  0  1  1  0  0  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 176 #######################


> Neighbours evaluated; 75
> Selected Move:	4900	3	19	11	25500


> New Y[]: 
	
	 0  3  0  0  0  0  1  1  0  0  1  2  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,525

## ITERATION 177 #######################


> Neighbours evaluated; 59
> Selected Move:	4850	3	11	0	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,53

## ITERATION 178 #######################


> Neighbours evaluated; 64
> Selected Move:	4850	3	7	4	24000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 179 #######################


> Neighbours evaluated; 85
> Selected Move:	4850	3	4	8	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 180 #######################


> Neighbours evaluated; 81
> Selected Move:	5010	3	6	12	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 181 #######################


> Neighbours evaluated; 76
> Selected Move:	4850	3	8	6	23500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 182 #######################


> Neighbours evaluated; 68
> Selected Move:	4850	3	10	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 183 #######################


> Neighbours evaluated; 67
> Selected Move:	4850	3	5	8	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,53

## ITERATION 184 #######################


> Neighbours evaluated; 65
> Selected Move:	4850	3	12	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,525

## ITERATION 185 #######################


> Neighbours evaluated; 73
> Selected Move:	4858	3	14	18	25500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 186 #######################


> Neighbours evaluated; 67
> Selected Move:	4850	3	5	14	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,515

## ITERATION 187 #######################


> Neighbours evaluated; 71
> Selected Move:	4861	3	1	4	25600


> New Y[]: 
	
	 2  0  0  0  3  0  1  0  1  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,51

## ITERATION 188 #######################


> Neighbours evaluated; 84
> Selected Move:	4801	3	4	11	25900


> New Y[]: 
	
	 2  0  0  0  0  0  1  0  1  0  0  3  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 189 #######################


> Neighbours evaluated; 77
> Selected Move:	4816	3	8	5	25900


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  3  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 190 #######################


> Neighbours evaluated; 61
> Selected Move:	4780	3	11	4	25600


> New Y[]: 
	
	 2  0  0  0  3  1  1  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 191 #######################


> Neighbours evaluated; 71
> Selected Move:	4747	3	6	3	25600


> New Y[]: 
	
	 2  0  0  1  3  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,51

## ITERATION 192 #######################


> Neighbours evaluated; 81
> Selected Move:	4694	3	5	8	25600


> New Y[]: 
	
	 2  0  0  1  3  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,515

## ITERATION 193 #######################


> Neighbours evaluated; 85
> Selected Move:	4800	3	4	1	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,52

## ITERATION 194 #######################


> Neighbours evaluated; 83
> Selected Move:	4820	3	14	5	25500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,525

## ITERATION 195 #######################


> Neighbours evaluated; 70
> Selected Move:	4800	3	18	14	25000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,53

## ITERATION 196 #######################


> Neighbours evaluated; 77
> Selected Move:	4800	3	5	10	23500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 197 #######################


> Neighbours evaluated; 85
> Selected Move:	4890	3	14	16	24000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 198 #######################


> Neighbours evaluated; 76
> Selected Move:	4960	3	13	18	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  1  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 
 > pw :0,545

## ITERATION 199 #######################


> Neighbours evaluated; 59
> Selected Move:	4990	3	3	6	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0 
 > pw :0,54

## ITERATION 200 #######################


> Neighbours evaluated; 60
> Selected Move:	4890	3	6	13	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,535

## ITERATION 201 #######################


> Neighbours evaluated; 81
> Selected Move:	4890	3	18	6	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,53

## ITERATION 202 #######################


> Neighbours evaluated; 79
> Selected Move:	4805	3	16	7	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,525

## ITERATION 203 #######################


> Neighbours evaluated; 50
> Selected Move:	4808	3	8	12	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,52

## ITERATION 204 #######################


> Neighbours evaluated; 44
> Selected Move:	4890	3	6	3	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  0  1  0  1  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,515

## ITERATION 205 #######################


> Neighbours evaluated; 55
> Selected Move:	4822	3	3	14	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  0  0  1  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 206 #######################


> Neighbours evaluated; 53
> Selected Move:	4800	3	7	3	23500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 207 #######################


> Neighbours evaluated; 79
> Selected Move:	4800	3	10	5	25000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 208 #######################


> Neighbours evaluated; 71
> Selected Move:	4800	3	5	8	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  1  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 209 #######################


> Neighbours evaluated; 77
> Selected Move:	4712	3	14	16	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 210 #######################


> Neighbours evaluated; 65
> Selected Move:	4740	3	3	6	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 211 #######################


> Neighbours evaluated; 66
> Selected Move:	4738	3	8	5	25500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0 
 > pw :0,51
________________________________________________________________

Best solution found: 5880
Run Termination time: 03.02.2010 21:22:04
Run duration: 00:03:14.9687500
________________________________________________________________
